Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
نویسندگان
چکیده
We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Nešetřil-Rödl Theorem, the author’s Ramsey lift of bowtiefree graphs as well as the Ramsey Theorem for Finite Models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of Structural Ramsey Theorem. We give here a more concise reformulation of recent authors paper “All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)” and the main purpose of this paper is to show several applications. Particularly we prove the Ramsey property of ordered sets with equivalences on the power set, Ramsey theorem for Steiner systems, Ramsey theorem for resolvable designs and a partial Ramsey type results for H-factorizable graphs. All of these results are natural, easy to state, yet proofs involve most of the theory developed.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملRamsey classes with forbidden homomorphisms and a closure
Extending classical early Ramsey-type results, the structural Ramsey theory originated at the beginning of 70ies, see [11] for references. However the list of Ramsey classes, as the top of the line of Ramsey properties, was somewhat limited. This was also supported by result of Nešetřil [7] that made a connection between Ramsey classes and ultrahomogeneous structures showing particularly that t...
متن کاملComplexity Classes Deened by Counting Quantiiers*
We study the polynomial time counting hierarchy, a hierarchy of complexity classes related to the notion of counting. We investigate some of their structural properties, settling many open questions dealing with oracle characterizations, closure under boolean operations, and relations with other complexity classes. We develop a new combinatorial technique to obtain relativized separations for s...
متن کاملRamsey theory and partially ordered sets
Over the past 15 years, Ramsey theoretic techniques and concepts have been applied with great success to partially ordered sets. In the last year alone, four new applications of Ramsey theory to posets have produced solutions to some challenging combinatorial problems. First, Kierstead and Trotter showed that dimension for interval orders can be characterized by a single ramsey trail by proving...
متن کاملReducts of Ramsey structures
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the endomorphism monoid, or the polymorphism clone of a structure. Such functions can be particularly well understood when the relational structure is countably infin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.01924 شماره
صفحات -
تاریخ انتشار 2017